Constraint-based reasoning via Grobner Bases
نویسندگان
چکیده
منابع مشابه
Grobner-shirshov Bases for Representation Theory
In this paper, we develop the Gr6bner-Shirshov basis theory for the representations of associative algebras by introducing the notion of Gr6bner-Shirshov pairs. Our result can be applied to solve the reduction problem in representation theory and to construct monomial bases of representations of associative algebras. As an illustration, we give an explicit construction of Gr6bner-Shirshov pairs...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملSystematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes
Any linear code with a nontrivial automorphism has the structure of a module over a polynomial ring. The theory of Griihner bases for modules gives a compact description and implementation of a systematic encoder. We present examples of algebraic-geometric Goppa codes that can be encoded by these methods, including the one-point Hermitian codes. Index TermsSystematic encoding, algebraic-geometr...
متن کاملThe Computation of Grobner Bases Using an Alternative Algorithm
When Zharkov and Blinkov ([ZB93]) applied the classical ideas of involutive systems originating from the theory of partial dierential equations (c.f. [Ja29],[Po78]) to the computation of Gr obner bases (c.f. [Bu65],[BW93]) their theory seemed to be a rather marginal concept. But due to the opportunity of gaining a faster version for one of the most frequently applied algorithms the method came...
متن کاملConstraint - Based Reasoning and Constraint Programming 182
We show the equivalence between the so-called DavisPutnam procedure [3, 2] and the Forward Checking of Haralick and Elliot [7]. Both apply the paradigm choose and propagate in two different formalisms, namely the propositional calculus and the constraint satisfaction problems formalism. They happen to be strictly equivalent as soon as a compatible instantiation order is chosen. This equivalence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence for Engineering Design, Analysis and Manufacturing
سال: 1997
ISSN: 0890-0604,1469-1760
DOI: 10.1017/s0890060400001803